/**
*      author: Y_Yao
*      created: 2025-02-26 10:10:06
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 100 + 7;
int a[N];
int n,m;
unordered_map<int,int> mp;

void solve()
{
    cin >> n >> m;
    for(int i = 0;i <= n;i++) a[i] = i,mp[a[i]] = i;
    int first = 0;
    while(m--)
    {
        int x;
        cin >> x;
        swap(a[mp[x]],a[mp[first]]);
        swap(mp[x],mp[first]);
        first = x;
    }
    for(int i = 1;i <= n;i++)
    {
        cout << a[i] << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}